Successful heuristic search planners for satisficing planning like FF or LAMA are usually based on one or more best first search techniques. Recent research has led to planners like Arvand, Roamer or Probe, where novel techniques like Monte-Carlo Random Walks extend the traditional exploitation-focused best first search by an exploration component. The UCT algorithm balances these contradictory incentives and has shown tremendous success in related areas of sequential decision making but has never been applied to classical planning yet. We make up for this shortcoming by applying the Trial-based Heuristic Tree Search framework to classical planning. We show how to model the best first search techniques Weighted A* and Greedy Best First Search with only three ingredients: action selection, initialization and backup function. Then we use THTS to derive four versions of the UCT algorithm that differ in the used backup functions. The experimental evaluation shows that our main algorithm, GreedyUCT*, outperforms all other algorithms presented in this paper, both in terms of coverage and quality.

The Cultural Geography (CG) model is a governmentowned, open-source agent-based model designed to Balancing the ratio of exploration and exploitation is an address the behavioral response of civilian populations in important problem in reinforcement learning [1]. If you conflict environments [3]. Agents within the CG Model examine the relationship between agent and the select their action according to a constant temperature environment in reinforcement learning, agent has two setting over the course of a model run. To enhance the action selections in its environment: exploration and functionality of agents in selecting their actions and to get exploitation. The agent can choose to explore its more realistic results with better utilities we changed this environment and try new actions in search for better ones constant to a dynamic parameter which depends on time in to be adopted in the future, or exploit already tested actions Time Based Selection and on utility in Aggregate Utility and adopt them.